Succinct definitions in the first order theory of graphs
نویسندگان
چکیده
منابع مشابه
Succinct definitions in the first order theory of graphs
We say that a first order sentence A defines a graph G if A is true on G but false on any graph non-isomorphic to G. Let L(G) (resp. D(G)) denote the minimum length (resp. quantifier rank) of a such sentence. We define the succinctness function s(n) (resp. its variant q(n)) to be the minimum L(G) (resp. D(G)) over all graphs on n vertices. We prove that s(n) and q(n) may be so small that for no...
متن کاملSuccinct Definitions in the First Order Theory of Graphs II: No Quantifier Alternation
We say that a first order sentence A defines a digraph G if A is true on G but false on any digraph non-isomorphic to G. Let Da(G) (resp. La(G)) denote the minimum quantifier rank (resp. length) of a such sentence in which negations occur only in front of atomic subformulas and any sequence of nested quantifiers has at most a quantifier alternations. We define the succinctness function qa(n) to...
متن کاملthe analysis of the role of the speech acts theory in translating and dubbing hollywood films
از محوری ترین اثراتی که یک فیلم سینمایی ایجاد می کند دیالوگ هایی است که هنرپیش گان فیلم میگویند. به زعم یک فیلم ساز, یک شیوه متأثر نمودن مخاطب از اثر منظوره نیروی گفتارهای گوینده, مثل نیروی عاطفی, ترس آور, غم انگیز, هیجان انگیز و غیره, است. این مطالعه به بررسی این مسأله مبادرت کرده است که آیا نیروی فراگفتاری هنرپیش گان به مثابه ی اعمال گفتاری در پنج فیلم هالیوودی در نسخه های دوبله شده باز تولید...
15 صفحه اولThe First-Order Theory of Ground Tree Rewrite Graphs
We prove that the complexity of the uniform first-order theory of ground tree rewrite graphs is in ATIME(22 poly(n) , O(n)). Providing a matching lower bound, we show that there is a fixed ground tree rewrite graph whose first-order theory is hard for ATIME(22 poly(n) , poly(n)) with respect to logspace reductions. Finally, we prove that there is a fixed ground tree rewrite graph together with ...
متن کاملFirst-Order Atom Definitions Extended
We extend the notion of atom definitions in first-order formulae by guards. These are conditions restricting the atom definition in a form that frequently occurs in many application areas of automated theorem proving. We give a sufficient and complete criterion for a formula to contain such a definition and provide an effective algorithm to actually retrieve the definition in an applicable form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 2006
ISSN: 0168-0072
DOI: 10.1016/j.apal.2005.04.003